Family metro maps

نویسندگان

چکیده

We present family metro maps as a new approach to visualize the relations between multiple related families. A is represented by line, where parents are end nodes and children intermediate nodes. introduce trees rooted binary consider problem of automatically drawing map for given tree without crossing line segments, successive placed at equal distances. The inter-node distance may be chosen depend on generation family, such that lines earlier generations shown more prominently than later generations. Family can used descendants couples have common descendants.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metro Maps of Information

When information is abundant, it becomes increasingly difficult to fit nuggets of knowledge into a single coherent picture. Complex stories spaghetti into branches, side stories, and intertwining narratives. In order to explore these stories, one needs a map to navigate unfamiliar territory. We have developed a methodology for creating structured summaries of information, which we call metro ma...

متن کامل

Automated Drawing of Metro Maps

This diploma thesis investigates the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g. the physical location of the tracks and stations of a metro system) and a set L of paths or cycles in G (e.g. metro lines) such that each edge of G belongs to at least one element of L, draw G and L nicely. We fi...

متن کامل

Automatic visualisation of metro maps

We investigate the new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing step. The experimental results with rea...

متن کامل

Drawing Metro Maps Using Bézier Curves

The automatic layout of metro maps has been investigated quite intensely over the last few years. Previous work has focused on the octilinear drawing style where edges are drawn horizontally, vertically, or diagonally at 45◦. Inspired by manually created curvy metro maps, we advocate the use of the curvilinear drawing style; we draw edges as Bézier curves. Since we forbid metro lines to bend (e...

متن کامل

Line Crossing Minimization on Metro Maps

We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is minimized. This problem arises when drawing metro maps, where the embedding of G depicts the structure of the underlying network, the nodes of G correspond to train stations, an edge connecting two nodes implies that t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Visualization

سال: 2021

ISSN: ['1875-8975', '1343-8875']

DOI: https://doi.org/10.1007/s12650-021-00796-6